A Fast Randomized Algorithm for Computing a Hierarchically Semiseparable Representation of a Matrix
نویسنده
چکیده
Randomized sampling has recently been proven a highly efficient technique for computing approximate factorizations of matrices that have low numerical rank. This paper describes an extension of such techniques to a wider class of matrices that are not themselves rank-deficient, but have off-diagonal blocks that are; specifically, the class of so called Hierarchically Semi-Separable (HSS) matrices. HSS matrices arise frequently in numerical analysis and signal processing, in particular in the construction of fast methods for solving differential and integral equations numerically. The HSS structure admits algebraic operations (matrix-vector multiplications, matrix factorizations, matrix inversion, etc.) to be performed very rapidly; but only once the HSS representation of the matrix has been constructed. How to rapidly compute this representation in the first place is much less well understood. The present paper demonstrates that if an N ×N matrix can be applied to a vector in O(N) time, and if individual entries of the matrix can be computed rapidly, then provided that an HSS representation of the matrix exists, it can be constructed in O(N k2) operations, where k is an upper bound for the numerical rank of the off-diagonal blocks. The point is that when legacy codes (based on, e.g., the Fast Multipole Method) can be used for the fast matrix-vector multiply, the proposed algorithm can be used to obtain the HSS representation of the matrix, and then well-established techniques for HSS matrices can be used to invert or factor the matrix.
منابع مشابه
Transforming a hierarchical into a unitary-weight representation
In this paper we consider a class of hierarchically rank structured matrices, including some of the hierarchical matrices occurring in the literature, such as hierarchically semiseparable (HSS) and certain H∈-matrices. We describe a fast O(rn log(n)) and stable algorithm to transform this hierarchical representation into a so-called unitary-weight representation, as introduced in an earlier wor...
متن کاملCompressing Rank-Structured Matrices via Randomized Sampling
Randomized sampling has recently been proven a highly efficient technique for computing approximate factorizations of matrices that have low numerical rank. This paper describes an extension of such techniques to a wider class of matrices that are not themselves rank-deficient but have off-diagonal blocks that are—specifically, the classes of so-called hierarchically off-diagonal low rank (HODL...
متن کاملFast algorithms for hierarchically semiseparable matrices
Semiseparable matrices and many other rank-structured matrices have been widely used in developing new fast matrix algorithms. In this paper, we generalize the hierarchically semiseparable (HSS) matrix representations and propose some fast algorithms for HSS matrices. We represent HSS matrices in terms of general binary HSS trees and use simplified postordering notation for HSS forms. Fast HSS ...
متن کاملO(n) Algorithms for Banded Plus Semiseparable Matrices
We present a new representation for the inverse of a matrix that is a sum of a banded matrix and a semiseparable matrix. In particular, we show that under certain conditions, the inverse of a banded plus semiseparable matrix can also be expressed as a banded plus semiseparable matrix. Using this result, we devise a fast algorithm for the solution of linear systems of equations involving such ma...
متن کاملMfrs: an Algorithm for the Structured Multifrontal Solution of Large Sparse Matrices via Randomized Sampling
This paper presents strategies for the development of an efficient algorithm (MFRS) for the direct solutions of large sparse linear systems. The algorithm is based on a structured multifrontal method with randomized sampling. We propose data structures and access schemes for a type of rank structured matrices, called Hierarchically SemiSeparable (HSS) forms. A data tree structure is used for HS...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 32 شماره
صفحات -
تاریخ انتشار 2011